A Random Variable Substitution Lemma With Applications to Multiple Description Coding

نویسندگان

  • Jia Wang
  • Jun Chen
  • Lei Zhao
  • Paul W. Cuff
  • Haim H. Permuter
چکیده

We establish a random variable substitution lemma and use it to investigate the role of refinement layer in multiple description coding, which clarifies the relationship among several existing achievable multiple description rate-distortion regions. Specifically, it is shown that the El Gamal-Cover (EGC) region is equivalent to the EGC* region (an antecedent version of the EGC region) while the Venkataramani-Kramer-Goyal (VKG) region (when specialized to the 2-description case) is equivalent to the Zhang-Berger (ZB) region. Moreover, we prove that for multiple description coding with individual and hierarchical distortion constraints, the number of layers in the VKG scheme can be significantly reduced when only certain weighted sum rates are concerned. The role of refinement layer in scalable coding (a special case of multiple description coding) is also studied. Index Terms Contra-polymatroid, multiple description coding, rate-distortion region, scalable coding, successive refinement,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding

Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...

متن کامل

On multiple descriptions and team guessing

Witsenhausen's hyperbola bound for the multiple description problem without excess rate in case of a binary source is not right for exact joint reproductions. However, this bound is tight for almost{exact joint reproductions (Theorem 1, conjectured by Witsenhausen). The proof is based on an approximative form of the team guessing lemma for sequences of random variables. (This result may be of i...

متن کامل

Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory

We formulate principles of induction and recursion for a variant of lambda calculus in its original syntax (i.e., with only one sort of names) where α-conversion is based upon name swapping as in nominal abstract syntax. The principles allow to work modulo α-conversion and implement the Barendregt variable convention. We derive them all from the simple structural induction principle on concrete...

متن کامل

Inaccessible Entropy and its Applications

We summarize the constructions of PRGs from OWFs discussed so far and introduce the notion of inaccessible entropy [HILL99, HRVW09]. Remember that we are trying to construct objects that look random (PRGs) from an assumption about hardness of computation (OWFs). So far we have seen that it is possible to construct PRGs from OWFs if the OWF has some nice structural property. One-way Permutations...

متن کامل

Patterns of nucleotide substitution in mitochondrial protein coding genes of vertebrates.

Maximum likelihood methods were used to study the differences in substitution rates among the four nucleotides and among different nucleotide sites in mitochondrial protein-coding genes of vertebrates. In the 1st + 2nd codon position data, the frequency of nucleotide G is negatively correlated with evolutionary rates of genes, substitution rates vary substantially among sites, and the transitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0909.3135  شماره 

صفحات  -

تاریخ انتشار 2009